captcha index cultur artifact onlin discoveri mainten time seri motif compress base distanc measur textur analysi textur import subroutin applic area divers biologi medicin robot forens scienc decad extens research algorithm measur textur similar exist method requir care set paramet problem surfeit paramet obviou paramet fit exception difficult avoid fit work propos extend recent advanc kolmogorov complex base similar measur textur match problem kolmogorov base method shown intrins discret domain dna protein sequenc midi music natur languag defin realvalu data introduc campana keogh ck video compress base method textur measur measur util state theart video compressor approxim kolmogorov complex ck method creat effici robust paramet free textur similar measur ck distanc measur demonstr util measur extens empir evalu real world case studi drawn nematolog arachnolog entomolog medicin forens ecolog textur analysi benchmark mine time seri data decad wit tremend growth interest applic deal queri mine time seri data numer represent method dimension reduct similar measur gear time seri introduc individu work introduc method made specif claim occasion theoret justif provid quantit experiment observ part compar aspect experi narrowli focus demonstr benefit propos method previous introduc order provid comprehens valid conduct extens set time seri experi implement represent method similar measur variant test effect time seri data set wide varieti applic domain paper give overview techniqu present compar experiment find effect experi provid unifi valid exist achiev case suggest claim literatur unduli optimist experiment comparison represent method distanc measur time seri data survei sequenc classif compress dbase distanc measur textur analysi textur import subroutin applic area divers biologi medicin robot forens scienc decad extens research algorithm measur textur similar exist method requir care set paramet problem surfeit paramet obviou paramet fit exception difficult avoid fit work propos extend recent advanc kolmogorov complex base similar measur textur match problem kolmogorov base method shown intrins discret domain dna protein sequenc midi music natur languag defin realvalu data introduc campana keogh ck video compress base method textur measur measur util state theart video compressor approxim kolmogorov complex ck method creat effici robust paramet free textur similar measur ck distanc measur demonstr util measur extens empir evalu real world case studi drawn nematolog arachnolog entomolog medicin forens ecolog textur analysi benchmark find time seri motif disk dresid data augment histor manuscript automat hyperlink augment gener hough transform enabl mine petroglyph rock art archaeolog term human made mark stone believ million petroglyph north america studi valu cultur resourc implic anthropolog histori surprisingli imag process inform retriev data mine larg impact human endeavor essenti impact studi rock art work identifi reason introduc distanc measur algorithm effici effect data mine larg collect rock art find centuri dold hyperlink semi dsupervis learn techniqu augment gener hough transform enabl mine petroglyph rock art archaeolog term human made mark stone believ million petroglyph north america studi valu cultur resourc implic anthropolog histori surprisingli imag process inform retriev data mine larg impact human endeavor essenti impact studi rock art work identifi reason introduc distanc measur algorithm effici effect data mine larg collect rock art time seri shapelet primit data mine classif time seri attract great interest past decad recent empir evid strongli suggest simpl nearest neighbor algorithm difficult beat time seri problem consid good new simplic implement nearest neighbor algorithm neg consequ nearest neighbor algorithm requir store search entir dataset result time space complex limit applic resourc limit sensor mere classif accuraci gain insight data work introduc time seri primit time seri shapelet address limit inform shapelet time seri subsequ sens maxim repres class show extens empir evalu divers domain algorithm base time seri shapelet primit interpret accur significantli faster state art classifi exact discoveri time seri motif time seri motif pair individu time seri subsequ longer time seri similar discret analogu comput biologi similar hint structur conserv reason interest formal time seri motif dozen research divers applic domain obviou algorithm comput motif quadrat number item dozen approxim algorithm discov motif propos literatur work time show tractabl exact algorithm find time seri motif show extens experi algorithm order magnitud faster brute forc search larg dataset show algorithm fast subroutin higher level data mine algorithm anytim classif duplic detect summar detail case studi domain divers electroencephalograph interpret entomolog telemetri data mine autocannibalist anyspac index algorithm applic sensor data mine effici index heart data mine algorithm simpl extrem effect algorithm index metric space introduc orchard orchard algorithm receiv attent data mine databas commun fatal flaw requir quadrat space work show produc reduc version orchard algorithm requir space produc ident speedup achiev cast algorithm anyspac framework allow deploi applic index main memori sensor afford demonstr abil creat anyspac algorithm creat auto cannibalist algorithm auto cannibalist algorithm algorithm initi requir amount space index classifi data unexpect circumst requir store addit inform dynam delet part make room data demonstr util autocannibalist algorithm field project insect monitor low power sensor simpl autonom robot applic isax disk dawar mine index massiv time seri dataset support exact index arbitrarili rotat shape period time seri euclidean warp distanc measur real dtime classif stream sensor data decad huge interest classif time seri work assum data resid main memori process offlin recent advanc sensor technolog requir resourc effici algorithm implement directli sensor real time algorithm show recent introduc framework time seri classif time seri bitmap implement effici classifi updat constant time space face high data arriv rate describ result case studi import entomolog problem demonstr gener idea robot annot histor archiv imag isax index mine terabyt size time seri current research index mine time seri data produc interest algorithm represent led algorithm scale increasingli massiv dataset encount scienc engin busi domain work show multiresolut symbol represent index dataset order magnitud larger consid literatur approach fast exact search ultra fast approxim search show exploit combin type search routin data mine algorithm allow exact mine massiv real world dataset million time seri asymmetr approxim anytim join primit applic data mine long note data mine algorithm built top join algorithm lead wealth recent work effici support join index techniqu applic character special condit firstli dataset join radic size situat call asymmetr join dataset possibl index reason circumst time complex proport product number object dataset unten proposit case work make contribut mitig situat argu applic exact solut problem requir show frame problem index mine time seri data current research index mine time seri data produc interest algorithm represent led algorithm scale increasingli massiv dataset encount scienc engin busi domain work show multiresolut symbol represent index dataset order magnitud larger consid literatur approach fast exact search ultra fast approxim search show exploit combin type search routin data mine algorithm allow exact mine massiv real world dataset million time seri cluster analysi target group identif local motor insur industri effici find unusu shape larg imag databas stream time seri summar user ddefin amnes function fast dmatch shape search rotat dinvari metric space object recognit content base imag retriev system reli heavili accur effici identif shape fundament requir shape analysi process shape similar comput invariantli basic geometr transform scale shift importantli rotat scale shift invari easili achiev suitabl shape represent rotat invari harder deal work explor metric properti rotat invari distanc measur propos algorithm fast similar search shape space algorithm util number import data mine task shape cluster classif discov motif discord imag collect techniqu demonstr introduc dramat speed current approach guarante introduc fals dismiss disk awar discord discoveri find unusu time seri terabyt size dataset problem find unusu time seri recent attract attent promis method literatur virtual propos method assum data resid main memori real world problem case astronomi multi terabyt time seri dataset norm current algorithm face data fit main memori resort multipl scan disk tape intract work show definit unusu time seri time seri discord discov disk awar algorithm propos algorithm exact requir linear scan disk tini buffer main memori simpl implement algorithm provid evid effect discord definit area divers astronomi web queri mine video surveil show effici method dataset order magnitud larger attempt literatur queri mine time seri data experiment comparison represent distanc measur decad wit tremend growth interest applic deal queri mine time seri data numer represent method dimension reduct similar measur gear time seri introduc individu work introduc method made specif claim occasion theoret justif provid quantit experiment observ part compar aspect experi narrowli focus demonstr benefit propos method previous introduc order provid comprehens valid conduct extens set time seri experi implement represent method similar measur variant test effect time seri data set wide varieti applic domain paper give overview techniqu present compar experiment find effect experi provid unifi valid exist achiev case suggest claim literatur unduli optimist convert dparametr distanc dbase classif anytim algorithm scale time warp time seri queri ts dtree effici similar base organ trajectori data disk awar discord discoveri find unusu time seri terabyt size dataset problem find unusu time seri recent attract attent promis method literatur virtual propos method assum data resid main memori real world problem case astronomi multi terabyt time seri dataset norm current algorithm face data fit main memori resort multipl scan disk tape intract work show definit unusu time seri time seri discord discov disk awar algorithm propos algorithm exact requir linear scan disk tini buffer main memori simpl implement algorithm provid evid effect discord definit area divers astronomi web queri mine video surveil show effici method dataset order magnitud larger attempt literatur local constrain support vector cluster detect time seri motif uniform scale time seri motif approxim repeat pattern found data motif util data mine algorithm includ rule discoveri novelti detect summar cluster formal problem introduct effici linear time algorithm motif discoveri successfulli appli domain includ medicin motion captur robot meteorolog work show previou applic time seri motif sever limit definit brittl slight uniform scale speed pattern develop introduc algorithm discoveri time seri motif invari uniform scale show produc object superior result import domain gener motif discoveri algorithm contribut work simpler previou approach drastic reduc number paramet visual explor genom data widespread accept uptak grid technolog achiev ensur secur mechan need support grid base collabor strong local secur mechan predomin secur address grid commun public kei infrastructur pki support authent whilst pki address user ident issu authent provid fine grain control user allow remot resourc authoris grid commun put forward numer softwar propos authoris infrastructur akenti ca cardea gsi permi vom clear forese futur collect solut norm address global grid forum ggf propos gener saml base authoris api principl fine grain control authoris access grid servic experi appli stress test api varieti applic domain essenti give insight practic aspect larg scale usag authoris infrastructur paper present experi dti fund bridg project jisc fund dyvos project api globu version permi authoris infrastructur fast dmatch shape search rotat invari metric space object recognit content base imag retriev system reli heavili accur effici identif shape fundament requir shape analysi process shape similar comput invariantli basic geometr transform scale shift importantli rotat scale shift invari easili achiev suitabl shape represent rotat invari harder deal work explor metric properti rotat invari distanc measur propos algorithm fast similar search shape space algorithm util number import data mine task shape cluster classif discov motif discord imag collect techniqu demonstr introduc dramat speed current approach guarante introduc fals dismiss fast dmatch shape search rotat invari metric space object recognit content base imag retriev system reli heavili accur effici identif shape fundament requir shape analysi process shape similar comput invariantli basic geometr transform scale shift importantli rotat scale shift invari easili achiev suitabl shape represent rotat invari harder deal work explor metric properti rotat invari distanc measur propos algorithm fast similar search shape space algorithm util number import data mine task shape cluster classif discov motif discord imag collect techniqu demonstr introduc dramat speed current approach guarante introduc fals dismiss find motif databas shape problem effici find imag similar target imag attract attent imag process commun rightli consid inform retriev task problem find structur regular larg imag dataset area data mine begin make fundament contribut work problem discov shape motif approxim repeat shape imag collect show shape motif applic task divers anthropolog law enforc histor manuscript mine brute forc discoveri shape motif unten slow domain requir expens rotat invari distanc measur introduc algorithm order magnitud faster brute forc search demonstr util approach real world dataset divers domain wat find top dk discord time seri databas find discord time seri databas import problem great varieti applic space shuttl telemetri mechan industri biomedicin financi data analysi previou method problem suffer paramet set difficult user approach knowledg compar fewer paramet requir user choos word size compress subsequ paper propos haar wavelet augment trie base algorithm mine top discord time seri databas dynam determin word size compress due characterist haar wavelet transform algorithm greater prune power previou approach experi annot dataset effect effici algorithm attest compress dbase data mine sequenti data experienc sax symbol represent time seri high level represent time seri propos data mine includ fourier transform wavelet eigenwav piecewis polynomi model research consid symbol represent time seri note represent potenti research avail wealth data structur algorithm text process bioinformat commun symbol represent time seri introduc past decad suffer fatal flaw firstli dimension symbol represent origin data virtual data mine algorithm scale poorli dimension distanc measur defin symbol approach distanc measur correl distanc measur defin origin time seri work formul symbol represent time seri represent uniqu dimension numeros reduct distanc measur defin symbol approach lower bound distanc measur defin origin seri demonstr featur excit run data mine algorithm effici manipul symbol represent produc ident result algorithm oper origin data demonstr util domain ddriven action knowledg discoveri find unusu time seri subsequ algorithm applic work introduc problem find time seri discord time seri discord subsequ longer time seri maxim rest time seri subsequ captur sens unusu subsequ time seri time seri discord data mine includ improv qualiti cluster data clean summar anomali detect show discord attract anomali detector requir intuit paramet length subsequ unlik anomali detect algorithm typic requir paramet brute forc algorithm discov time seri discord quadrat length time seri show simpl algorithm order magnitud faster brute forc guarante produc ident result evalu work comprehens set experi demonstr util discord object experi domain divers space shuttl telemetri monitor medicin surveil industri demonstr effect discord discoveri algorithm million experi dataset divers domain effici queri filter stream time seri applic semisupervis learn time seri classifi data mine inform retriev time seri fmultimedia databas find time seri discord base haar transform abstract problem find anomali receiv attent recent anomali detect algorithm depend explicit definit anomali imposs elicit domain expert discord anomali detector paramet set requir keogh al propos effici method solv problem algorithm requir user choos word size compress subsequ paper propos algorithm dynam determin word size compress method base properti haar wavelet transform experi show method highli effect configur cach subset fast cach tune ensembl nearest neighbor forecast abstract nearest neighbor forecast model attract simplic abil predict complex nonlinear behavior reli assumpt observ similar target similar outcom common practic nearest neighbor model select comput global optim number neighbor valid set appli incom queri queri number suboptim forecast deviat lot true realiz produc address problem propos altern approach train ensembl nearest neighbor predictor determin number neighbor individu queri demonstr forecast ensembl improv significantli global optim singl predictor manifold cluster shape shape cluster significantli facilit automat label object present imag collect outlin exist group patholog cell bank cyto imag group speci photograph collect aerial group object observ surveil scene offic build demonstr nonlinear project algorithm isomap attract shape similar object suggest exist isometri shape space low dimension nonlinear embed small amount nois data project form compact convex cluster easili learn subsequ partit scheme propos modif isomap project base concept degre bound minimum span tree propos approach demonstr move bridg cluster allevi effect nois data anytim classif nearest neighbor algorithm applic stream mine real world problem perform classif wide vari amount comput resourc ask classifi instanc bursti stream millisecond minut return class predict problem anytim algorithm work show convert ubiquit nearest neighbor classifi anytim algorithm produc instant classif luxuri addit time util extra time increas classif accuraci demonstr util approach comprehens set experi data divers domain saxual explicit imag find unusu shape visual featur multimedia content shape interest human recogn object sole basi shape past decad great deal research shape analysi focus shape index cluster classif work introduc problem find shape discord unusu shape collect motiv problem util shape discord divers domain includ zoologi anthropolog medicin brute forc search algorithm quadrat time complex avoid local sensit hash estim similar shape enabl reorder search effici extens experiment evalu demonstr approach speed comput order magnitud intellig icon integr lite dweight data mine visual gui oper system vast major visual tool introduc special piec softwar explicitli run dataset time purpos work introduc framework allow visual place background normal dai dai oper gui base oper system ms window os linux allow visual occur background quotidian comput activ find move delet copi file greater possibl unexpect serendipit discoveri system work replac standard file icon automat creat icon reflect content file principl call icon intellig icon util examin individu icon examin group advantag small multipl paradigm advoc tuft enhanc util intellig icon arrang screen reflect similar differ tradit view date view size demonstr util approach data divers dna text file electrocardiogram space shuttl telemetri addit show system uniqu support fast intuit similar search cluster workflow requir compress dissimilar measur fast time seri classif numeros reduct algorithm propos problem time seri classif clear nearest neighbor dynam time warp dtw distanc exception difficult beat approach weak computation demand realtim applic mitig problem speed dtw calcul nonetheless limit work propos addit techniqu numeros reduct speed nearestneighbor dtw idea numeros reduct nearest neighbor classifi long histori show leverag origin observ relationship dataset size dtw constraint produc extrem compact dataset loss accuraci test idea comprehens set experi show effici produc extrem fast accur classifi global distanc dbase segment trajectori work introduc distanc base criteria segment object trajectori segment lead simplif origin object smaller complex primit suit storag retriev purpos previou work trajectori segment attack problem local segment separ trajectori databas directli optim inter object separ mine oper search cluster classif larg databas paper analyz trajectori segment problem global perspect util data awar distanc base optim techniqu optim pairwis distanc estim lead effici object prune deriv exact solut distanc base formul due intract complex exact solut present approxim greedi solut exploit forward search local optim solut greedi solut impos prohibit comput cost put forward lightweight varianc base segment techniqu intellig relax pairwis distanc area affect mine oper semi dsupervis time seri classif semi dsupervis time seri classif group sax extend notion contrast set time seri multimedia data abstract work tradit notat contrast set extend data type time seri extens imag tradit sens contrast set mine identifi attribut valu instanc differ significantli group help user understand differ group data reformul notion contrastset time seri data defin kei pattern maxim set data propos fast exact algorithm find contrast set demonstr util divers domain rang manufactur anthropolog show algorithm achiev order magnitud speedup brute forc algorithm produc exact solut group sax extend notion contrast set time seri multimedia data abstract work tradit notat contrast set extend data type time seri extens imag tradit sens contrast set mine identifi attribut valu instanc differ significantli group help user understand differ group data reformul notion contrastset time seri data defin kei pattern maxim set data propos fast exact algorithm find contrast set demonstr util divers domain rang manufactur anthropolog show algorithm achiev order magnitud speedup brute forc algorithm produc exact solut decad progress index mine larg time seri databas lb fkeogh support exact index shape rotat invari arbitrari represent distanc measur match dimension shape import problem applic domain divers biometr industri medicin anthropolog distanc measur invari distort includ scale offset nois partial occlus distort easi handl represent data similar measur rotat invari uniqu difficult current approach typic achiev rotat invari represent data expens discrimin abil distanc measur expens effici work show slow accur approach dramat speed real world problem techniqu current approach make order magnitud faster fals dismiss techniqu dozen exist shape represent popular distanc measur includ euclidean distanc dynam time warp longest common subsequ bit level represent time seri data mine shape base similar abstract clip process transform real valu seri sequenc bit repres data averag paper argu clip flexibl transform exploratori analysi larg time depend data set demonstr time seri store bit effici compress manipul assumpt discriminatori power clip seri asymptot equival achiev raw data unlik transform clip seri compar directli raw data seri show mean form tight lower bound metric euclidean dynam time warp distanc effici queri content clip data conjunct host algorithm statist test natur follow binari natur data seri experi illustr clip seri increasingli complex wai achiev result popular techniqu us represent demonstr fact result clip data consist achiev wavelet discret fourier transform compress ratio cluster queri content flexibl represent shown fact advantag variabl run length encod clip seri defin approxim kolmogorov complex perform find unusu medic time dseri subsequ algorithm applic effici discoveri unusu pattern time seri index multidimension time dseri approxim magic find unusu medic time seri work introduc problem find time seri discord time seri discord subsequ longer time seri maxim rest time seri subsequ captur sens unusu subsequ time seri brute forc algorithm discov time seri discord quadrat length time seri show simpl algorithm order magnitud faster brute forc guarante produc ident result approxim magic find unusu medic time seri work introduc problem find time seri discord time seri discord subsequ longer time seri maxim rest time seri subsequ captur sens unusu subsequ time seri brute forc algorithm discov time seri discord quadrat length time seri show simpl algorithm order magnitud faster brute forc guarante produc ident result practic tool visual data mine medic time seri increas interest time seri data mine decad surprisingli impact real world medic applic real world practition work time seri daili basi rare advantag wealth tool data mine commun made work attempt address problem introduc simpl paramet light tool user effici navig larg collect time seri system uniqu advantag embed directli standard graphic user interfac microsoft window make deploy easier approach extract featur time seri arbitrari length inform rel frequenc featur color bitmap principl visual similar differ collect bitmap user quickli discov cluster anomali regular data collect demonstr util approach set comprehens experi real dataset varieti medic domain includ ecg eeg multimedia retriev time seri represent relev feedback hot sax effici find unusu time seri subsequ work introduc problem find time seri discord time seri discord subsequ longer time seri maxim rest time seri subsequ captur sens unusu subsequ time seri time seri discord data mine includ improv qualiti cluster data clean summar anomali detect show discord attract anomali detector requir intuit paramet length subsequ unlik anomali detect algorithm typic requir paramet evalu work comprehens set experi demonstr util discord object experi domain divers space shuttl telemetri monitor medicin surveil industri demonstr effect discord discoveri algorithm million experi dataset divers domain atom wedgi effici queri filter stream time seri applic desir monitor stream time seri predefin pattern domain divers monitor space telemetri patient intens care data insect popul data stream high rate number predefin pattern larg imposs comparison algorithm propos techniqu exploit common predefin pattern monitor higher bandwidth maintain guarante fals dismiss approach base wide envelop base lower bound techniqu extens experi demonstr approach achiev tremend improv perform offlin case signific improv fastest arriv rate data stream process guarante fals dismiss partial elast match time seri problem elast match time seri propos algorithm determin subsequ target time seri match queri seri propos algorithm map problem match subsequ problem cheapest path dag direct acycl graph propos approach comput optim scale translat time seri valu nontrivi problem case subsequ match dot plot time seri analysi introduct seventi gibb mcintyr dot plot prove power intuit techniqu visual sequenc analysi mine main domain applic field bioinformat frequent research order elucid genom sequenc similar align techniqu remain compar constrain domain data inher discret structur text paper demonstr dot plot analysi mine real valu time seri design tool creat highli descript dot plot easili detect similar anomali revers similar period frequenc repetit underli algorithm scale input size show feasibl plot line data monitor visual mine tempor data relev feedback learn distanc measur queri multimedia databas effici trajectori join symbol represent mpaa dbase iter cluster algorithm augment nearest neighbor search time dseri data stream mpaa dbase iter cluster algorithm augment nearest neighbor search time dseri data stream bit level time seri represent implic similar search cluster abstract time seri ubiquit increasingli preval type data research effort devot time seri data mine recent data mine problem kei effect scalabl algorithm choos represent data high level represent time seri propos data mine work introduc techniqu base bit level approxim data represent import advantag exist techniqu uniqu advantag raw data directli compar reduc represent guarante lower bound euclidean distanc fact exploit produc faster exact algorithm similarli search addit demonstr represent time seri cluster scale larger dataset elast partial match time seri abstract problem elast match time seri propos algorithm automat determin subsequ target time seri match queri seri propos algorithm map problem match subsequ problem cheapest path dag direct acycl graph experiment result demonstr propos algorithm outperform commonli dynam time warp retriev accuraci myth dynam time warp data mine recent advanc mine time seri data myth dynam time warp data mine time dseri bitmap practic visual tool work larg time seri databas increas interest time seri data mine decad result introduct varieti similar measur represent algorithm surprisingli massiv research effort impact real world applic real world practition work time seri daili basi rare advantag wealth tool data mine commun made work attempt address problem introduc simpl paramet light tool user effici navig larg collect time seri system uniqu advantag embed directli standard graphic user interfac microsoft window make deploy easier approach extract featur time seri arbitrari length inform rel frequenc featur color bitmap principl visual similar differ collect bitmap user quickli discov cluster anomali regular data collect demonstr util approach set comprehens experi real dataset varieti domain time dseri bitmap practic visual tool work larg time seri databas increas interest time seri data mine decad result introduct varieti similar measur represent algorithm surprisingli massiv research effort impact real world applic real world practition work time seri daili basi rare advantag wealth tool data mine commun made work attempt address problem introduc simpl paramet light tool user effici navig larg collect time seri system uniqu advantag embed directli standard graphic user interfac microsoft window make deploy easier approach extract featur time seri arbitrari length inform rel frequenc featur color bitmap principl visual similar differ collect bitmap user quickli discov cluster anomali regular data collect demonstr util approach set comprehens experi real dataset varieti domain assumpt dfree anomali detect time seri recent advanc sensor technolog made collect enorm amount data real time sheer volum data inspect algorithm human mitig problem perform type anomali novelti interesting surprising detect flag unusu pattern inspect human cpu intens algorithm current solut custom made domain ecg monitor valv pressur monitor custom requir extens effort domain expert handcraft system tend brittl concept drift demonstr show onlin anomali detect system custom individu domain perform exception high precis recal system base recent introduc idea time seri bitmap demonstr univers system test independ annot dataset domain divers ecg space shuttl telemetri monitor video surveil respiratori data addit invit attende test system dataset web scale time warp time seri queri mine time seri data decad wit tremend growth interest applic deal queri mine time seri data numer represent method dimension reduct similar measur gear time seri introduc individu work introduc method made specif claim occasion theoret justif provid quantit experiment observ part compar aspect experi narrowli focus demonstr benefit propos method previous introduc order provid comprehens valid conduct extens set time seri experi implement represent method similar measur variant test effect time seri data set wide varieti applic domain paper give overview techniqu present compar experiment find effect experi provid unifi valid exist achiev case suggest claim literatur unduli optimist index multi ddimension trajectori similar queri mine time seri data decad wit tremend growth interest applic deal queri mine time seri data numer represent method dimension reduct similar measur gear time seri introduc individu work introduc method made specif claim occasion theoret justif provid quantit experiment observ part compar aspect experi narrowli focus demonstr benefit propos method previous introduc order provid comprehens valid conduct extens set time seri experi implement represent method similar measur variant test effect time seri data set wide varieti applic domain paper give overview techniqu present compar experiment find effect experi provid unifi valid exist achiev case suggest claim literatur unduli optimist visual discov dtrivial pattern larg time seri databas integr lite dweight ubiquit data mine gui oper system exact index dynam time warp problem index time seri attract research interest databas commun algorithm index time seri util euclidean distanc variat thereof forcefulli shown euclidean distanc brittl distanc measur dynam time warp dtw robust distanc measur time seri allow similar shape match phase time axi guest editori vital sign medic emerg team cluster time dseri subsequ meaningless implic previou futur research time seri data frequent encount type data examin data mine commun cluster frequent data mine algorithm exploratori techniqu subroutin complex data mine algorithm rule discoveri index summar anomali detect classif fact surpris time seri cluster attract attent data cluster format individu time seri singl time seri individu time seri extract slide window recent explos interest stream data onlin algorithm case receiv attent work make surpris claim cluster stream time seri complet meaningless concret cluster extract stream time seri forc obei constraint patholog satisfi dataset cluster extract cluster algorithm essenti random constraint intuit demonstr simpl illustr simpl prove appear literatur justifi call claim surpris invalid contribut dozen previous publish paper justifi claim theorem illustr exampl comprehens set experi reimplement previou work primari contribut work draw attent fact appar solut import problem incorrect longer introduc method base concept time seri motif meaningfulli cluster stream time seri dataset guest editori vital sign medic emerg team futur symbol futur symbol iter increment cluster time seri present anytim version partit cluster algorithm mean em time seri algorithm work leverag multi resolut properti wavelet dilemma choos initi center mitig initi center approxim level final center return coarser represent addit cast cluster algorithm anytim algorithm approach desir properti work lower dimension effici avoid local minima qualiti cluster batch algorithm addit algorithm run complet approach faster batch counterpart explain empir demonstr surpris desir properti comprehens experi publicli real data set demonstr approach gener framework broader rang algorithm data mine problem onlin amnes approxim stream time seri past decad wealth research time seri represent manipul storag index larg volum raw time seri data impract vast major research concentr represent calcul batch mode repres approxim equal fidel increas deploy mobil devic real time sensor brought home represent increment updat approxim data fidel proport ag properti answer queri recent past greater precis domain recent inform older inform call represent amnes paramet dfree data mine data mine algorithm requir set input paramet main danger work paramet laden algorithm incorrect set algorithm fail find true pattern insidi problem algorithm report spuriou pattern exist greatli overestim signific report pattern user fail understand role paramet data mine process data mine algorithm paramet ideal paramet free algorithm limit abil impos prejudic expect presumpt problem hand data speak work show recent result bioinformat comput theori hold great promis paramet free datamin paradigm result motiv observ kolmogorov complex theori practic matter implement shelf compress algorithm addit dozen line code show approach competit superior stateof art approach anomali interesting detect classif cluster empir test time seri dna text video dataset visual mine monitor massiv time seri moment launch space vehicl engin disciplin specialist make critic decis cost fals posit allow launch spite fault fals neg stop potenti success launch measur ten million dollar includ cost moral intang detriment aerospac corpor respons provid engin assess critic decis depart defens space vehicl assess made constantli monitor stream telemetri data hour launch introduc viztre time seri visual tool aid aerospac analyst make engin assess viztre develop univers california riversid uniqu tool mine archiv data monitor incom live telemetri singl tool aspect task natur intuit transfer mine knowledg monitor task visual approach work transform time seri symbol represent encod data modifi suffix tree frequenc properti pattern map color visual properti demonstr util system compar state art batch algorithm real synthet dataset make time dseri classif accur learn constraint viztre tool visual mine monitor massiv time seri databas moment launch space vehicl engin disciplin specialist make critic decis cost fals posit allow launch spite fault fals neg stop potenti success launch measur ten million dollar includ cost moral intang detriment aerospac corpor respons provid engin assess critic decis depart defens dod launch vehicl assess made constantli monitor stream telemetri data hour launch demonstr introduc viztre time seri visual tool aid aerospac analyst make engin assess viztre develop univers california riversid uniqu tool mine archiv data monitor incom live telemetri unlik time seri visual tool viztre scale larg databas give potenti gener data mine databas tool index larg human dmotion databas data driven anim industri standard comput game anim movi special effect motion captur data record live actor promis approach offer anim realist human charact manipul data gener solv problem exist techniqu deal edit motion reli index annot segment order data euclidean distanc inappropri solv index problem inher variabl found human motion limit euclidean distanc stem fact sensit distort time axi partial solut problem dynam time warp dtw align time axi grid dbase index method time warp distanc symbol represent time seri parallel explos interest stream data data mine time seri surprisingli intersect spite fact time seri data typic stream data main reason appar paradox fact vast major work stream data explicitli assum data discret vast major time seri data real valu research cluster stream time seri meaningless time seri data frequent encount type data examin data mine commun cluster frequent data mine algorithm exploratori techniqu subroutin complex data mine algorithm rule discoveri index summar anomali detect classif fact surpris time seri cluster attract attent data cluster format individu time seri singl time seri individu time seri extract slide window recent explos interest stream data onlin algorithm case receiv attent work make surpris claim cluster stream time seri complet meaningless concret cluster extract stream time seri forc obei constraint patholog satisfi dataset cluster extract cluster algorithm essenti random constraint intuit demonstr simpl illustr simpl prove appear literatur justifi call claim surpris invalid contribut dozen previous publish paper justifi claim theorem illustr exampl comprehens set experi reimplement previou work primari contribut work draw attent fact appar solut import problem incorrect longer introduc method base concept time seri motif meaningfulli cluster stream time seri dataset find rule time seri surpris result implic previou futur research cluster time seri subsequ meaningless implic previou futur research time seri data frequent encount type data examin data mine commun cluster frequent data mine algorithm exploratori techniqu subroutin complex data mine algorithm rule discoveri index summar anomali detect classif fact surpris time seri cluster attract attent data cluster format individu time seri singl time seri individu time seri extract slide window recent explos interest stream data onlin algorithm case receiv attent work make surpris claim cluster stream time seri complet meaningless concret cluster extract stream time seri forc obei constraint patholog satisfi dataset cluster extract cluster algorithm essenti random constraint intuit demonstr simpl illustr simpl prove appear literatur justifi call claim surpris invalid contribut dozen previous publish paper justifi claim theorem illustr exampl comprehens set experi reimplement previou work primari contribut work draw attent fact appar solut import problem incorrect longer introduc method base concept time seri motif meaningfulli cluster stream time seri dataset grid dbase index larg time seri databas index multi ddimension time dseri support multipl distanc measur time seri data mine research concentr provid solut singl distanc function work motiv singl index structur support multipl distanc measur specif area interest effici retriev analysi trajectori similar trajectori dataset common environment applic mobil experi video surveil import discoveri biolog pattern primari similar measur base longest common subsequ lcss model offer enhanc robust noisi data encount real world applic index accommod distanc measur includ ubiquit euclidean distanc increasingli popular dynam time warp dtw research advoc similar measur major contribut work abil support measur restructur index framework guarante fals dismiss tailor provid faster respons time expens slightli reduc precis recal experiment result demonstr index speed comput expens similar measur lcss dtw probabilist discoveri time seri motif import time seri data mine problem reduc core task find approxim repeat subsequ longer time seri earlier work formal idea approxim repeat subsequ introduc notion time seri motif limit work poor scalabl motif discoveri algorithm inabl discov motif presenc nois address limit introduc algorithm inspir recent advanc problem pattern discoveri biosequ algorithm probabilist natur show empir theoret find time seri motif high probabl presenc nois don care symbol algorithm fast anytim algorithm produc candid motif immedi gradual improv qualiti result time effici find arbitrarili scale pattern massiv time seri databas gentl introduct machin learn data mine databas commun time seri data mine benchmark survei empir demonstr mine time seri data liter hundr paper introduc algorithm index classifi cluster segment time seri work make claim work util contribut made speed case index accuraci case classif cluster model accuraci case segment offer amount improv complet dwarf varianc observ test real world dataset varianc observ chang minor unstat implement detail illustr point augment visual queri mechan find pattern time seri data queri tool exist data explor pattern identif time seri data set previou work introduc timebox timebox rectangular direct manipul queri studi time seri dataset mine motif massiv time seri databas problem effici locat previous pattern time seri databas queri content receiv attent larg regard solv problem knowledg discoveri viewpoint interest problem enumer previous unknown frequent occur pattern call pattern motif close analog discret counterpart comput biologi effici motif discoveri algorithm time seri tool summar visual massiv time seri databas addit subroutin data mine task includ discoveri associ rule cluster classif time seri data mine benchmark survei empir demonstr mine time seri data liter hundr paper introduc algorithm index classifi cluster segment time seri work make claim work util contribut made speed case index accuraci case classif cluster model accuraci case segment offer amount improv complet dwarf varianc observ test real world dataset varianc observ chang minor unstat implement detail illustr point find surpris pattern time seri databas linear time space problem find pattern time seri databas queri content receiv attent matur field contrast import problem enumer surpris interest pattern receiv attent problem requir meaning definit surpris effici search techniqu previou attempt find surpris pattern time seri limit notion surpris scale massiv dataset overcom lim itat introduc techniqu defin pattern surpris frequenc occurr differ substanti expect chanc previous data notion advantag requir explicit definit surpris imposs elicit domain expert user simpli algorithm collect previous observ normal data algorithm suffix tree effici encod frequenc observ pattern markov model predict expect frequenc previous unobserv pattern suffix tree construct measur surpris pattern databas determin time space linear size databas demonstr util approach extens experiment evalu index mine time seri current research index mine time seri data produc interest algorithm represent led algorithm scale increasingli massiv dataset encount scienc engin busi domain work show multiresolut symbol represent index dataset order magnitud larger consid literatur approach fast exact search ultra fast approxim search show exploit combin type search routin data mine algorithm allow exact mine massiv real world dataset million time seri iter deepen dynam time warp time seri paper organ section detail motiv iddtw review classic dtw algorithm section introduc iddtw algorithm section experiment compar iddtw dtw euclidean distanc real synthet dataset section discuss relat work final section conclus direct futur work exact index dynam time warp problem index time seri attract research interest databas commun algorithm index time seri util euclidean distanc variat thereof forcefulli shown euclidean distanc brittl distanc measur dynam time warp dtw robust distanc measur time seri allow similar shape match phase time axi local adapt dimension reduct index larg time seri databas similar search larg time seri databas attract research interest recent difficult problem typic high dimension data promis solut involv perform dimension reduct data index reduc data multidimension index structur dimension reduct techniqu propos includ singular decomposit svd discret fourier transform dft discret wavelet transform dwt work introduc dimension reduct techniqu call adapt piecewis constant approxim apca previou techniqu svd dft dwt choos common represent item databas minim global reconstruct error apca approxim time seri set constant segment vari length individu reconstruct error minim show apca index multidimension index structur propos distanc measur index space exploit high fidel apca fast search lower bound euclidean distanc approxim lower bound tight euclidean distanc approxim show support fast exact searchin amp faster approxim search index structur theoret empir compar apca techniqu demonstr superior learn structur augment bayesian classifi paper approach construct augment bayesian network directli attempt approxim underli probabl distribut concentr sole represent improv classif accuraci show method construct augment bayesian network hill climb greedi search effici search algorithm call superpar compar friedman goldszmidt approach show approxim underli probabl distribut necessarili result accur classifi onlin algorithm segment time seri recent year explos interest mine time seri databas comput scienc problem represent data kei effici effect solut commonli represent piecewis linear approxim represent research support cluster classif index associ rule mine time seri data varieti algorithm propos obtain represent algorithm independ rediscov time paper undertak extens review empir comparison propos techniqu show algorithm fatal flaw data mine perspect introduc algorithm empir show superior literatur ensembl dindex approach index larg databas problem similar search queri content attract research interest difficult problem inher high dimension data promis solut involv perfoma dimension reduct data index reduc data multidimension index structur dimension reduct techniqu propos includ singular decomposit svd discret fourier transform dft discret wavelet transform dwt piecewis polynomi approxim work introduc framework ensembl represent effici index basic idea commit singl represent entir dataset represent chosen index part databas represent chosen base local view databas section data achiev high fidel represent wavelet index wavelet highli spectral section data index fourier transform queri time search small heterogen indic larg homogen index theoret empir demonstr result faster queri respons time local adapt dimension reduct index larg time seri databas similar search larg time seri databas attract research interest recent difficult problem typic high dimension data promis solut involv perform dimension reduct data index reduc data multidimension index structur dimension reduct techniqu propos includ singular decomposit svd discret fourier transform dft discret wavelet transform dwt work introduc dimension reduct techniqu call adapt piecewis constant approxim apca previou techniqu svd dft dwt choos common represent item databas minim global reconstruct error apca approxim time seri set constant segment vari length individu reconstruct error minim show apca index multidimension index structur propos distanc measur index space exploit high fidel apca fast search lower bound euclidean distanc approxim lower bound tight euclidean distanc approxim show support fast exact searchin amp faster approxim search index structur theoret empir compar apca techniqu demonstr superior dimension reduct fast similar search larg time seri databas problem similar search larg time seri databas attract attent recent trivial problem inher high dimension data promis solut involv perform dimension reduct data index reduc data spatial access method major dimension reduct techniqu propos singular decomposit svd discret fourier transform dft recent discret wavelet transform dwt work introduc dimension reduct techniqu call piecewis aggreg approxim paa theoret empir compar techniqu demonstr superior addit competit faster method approach numer advantag simpl understand implement flexibl distanc measur includ weight euclidean queri index built linear time scale dynam time warp datamin applic recent interest adapt data mine algorithm time seri databas algorithm compar time seri typic variat euclidean distanc demonstr paper euclidean distanc extrem brittl distanc measur dynam time warp dtw suggest techniqu robust distanc calcul computation expens paper introduc modif dtw oper higher level abstract data piecewis aggreg approxim paa approach outperform dtw order magnitud loss accuraci simpl dimension reduct techniqu fast similar search larg time seri databas address problem similar search larg time seri databas introduc scale dynam time warp massiv dataset recent interest adapt data mine algorithm time seri databas algorithm compar time seri typic variat extens euclidean distanc demonstr paper euclidean distanc extrem brittl distanc measur dynam time warp dtw suggest techniqu robust distanc calcul computation expens paper introduc modif dtw oper higher level abstract data piecewis linear represent demonstr approach outperform dtw order magnitud experiment evalu approach medic astronom sign languag data relev feedback retriev time seri data recent interest retriev time seri data earlier work fix similar metric euclidean distanc determin similar userspecifi queri item databas describ approach retriev time seri data relev feedback user adjust similar metric import euclidean distanc metric captur notion similar time seri euclidean distanc sensit distort offset translat amplitud scale depend domain user queri sensit insensit distort vari degre paper address problem introduc profil encod user subject notion similar domain profil learn continu interact user show user profil embed system relev feedback modifi queri manner analog familiar text retriev algorithm index scheme fast similar search larg time seri databas address problem similar search larg time seri databas introduc index algorithm faster retriev index form creat bin time seri subsequ approxim shape bin quickli calcul lower bound distanc queri similar element bin bound search bin order prune bin search space examin content addit speedup obtain optim data bin avoid compar queri item bin call approach stb index experiment valid space telemetri medic synthet data demonstr approxim order magnitud speed enhanc represent time seri fast accur classif introduc extend represent time seri fast accur classif cluster addit abil explor time seri data relev feedback framework represent consist piecewis linear segment repres shape weight vector rel import individu linear segment classif context weight learn automat part train cycl relev feedback context weight determin interact iter process user rate choic present represent user defin varieti similar measur tailor specif domain demonstr approach space telemetri medic synthet data fast similar search presenc longitudin scale time seri databas probabilist approach fast pattern match time seri databas 